When does one redundant parity-check equation matter?
نویسندگان
چکیده
We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (AWGN) channel. Our findings show that a large number of iterative decoding errors in the [2640, 1320] Margulis code, confined to point trapping sets in the standard Tanner graph, can be corrected if only one redundant parity-check equation is added to the decoder’s matrix. We also derive an analytic expression relating the number of rows in the parity-check matrix of a code and the parameters of trapping sets in the code’s graph.
منابع مشابه
Analyzing the Effect of Redundant Parity-Checks Using EXIT-Charts
•We observed that Low-Density ParityCheck (LDPC) codes based on partial geometries have superior performance to randomly constructed codes when decoded iteratively with the sum-product algorithm. •The reason for this good performance are redundant rows in the parity-check matrix. •We compared a parity-check matrix with redundant rows (Hredundant) with a matrix with full rank (Hfull) representin...
متن کاملPseudocodeword-Free Criterion for Codes with Cycle-Free Tanner Graph
Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cyclefree. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effe...
متن کاملStatistical mechanics of broadcast channels using low-density parity-check codes.
We investigate the use of Gallager's low-density parity-check (LDPC) codes in a degraded broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network communication schemes and is known to provide better performance than simple time sharing methods when algebraic codes are used. The statistical physics based a...
متن کاملTwo Methods for Reducing the Error-Floor of LDPC Codes
We investigate two techniques for reducing the error-floor of low-density parity-check codes under iterative decoding. Both techniques are developed based on comprehensive analytical and simulation studies of combinatorial properties of trapping sets in codes on graphs. The first technique represents an algorithmic modification of beliefpropagation based on data fusion principles and specialize...
متن کاملA Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique
A new approach for encoding one class of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. The proposed encoding method is applicable to parity-check matrices having dual-diagonal parity structure with single column of weight three in the parity generation region. Instead of finding the parity bits directly, the proposed method finds parity bits through vector correction. While...
متن کامل